Scalable Truly Random Number Generator
نویسنده
چکیده
Abstract—Despite the low cost and simple structure to generate pseudo random number, truly random number still has its own place in many security systems. We have proposed a truly random number generator with scalable parameters, different requirements focused on cost or performance can be satisfied with proper voltage and working frequency and the randomness has passed the test under NIST SP 800-22. The entropy source is based on ring oscillator and Von Neumann corrector is adopted to improve the bias. Additionally, some post-process circuit based on LFSR is introduced to flatten the distribution of sequence out from entropy source. Detailed optimization of each part is also discussed. Finally, power evaluation and customization have been done. The power cost can be down to 12.4 uW and the output bit rate can be up to 300Mb/s.
منابع مشابه
Zigzag map: A variability-aware discrete-time chaotic-map truly random number generator
In this letter, we present a circuit implementation for the discrete-time zigzag map, which exhibits high speed, low power consumption, and above all resilience to process variations. Circuit parameter variations result in alteration of the chaotic map parameters, such as the slope and the location of the breakpoints in the map, which in turn degrade the randomness of the generated bit sequence...
متن کاملSoftware Implementation of P−adic Self−shrinking Generator for Aerospace Cryptographic Systems
To be suitable for use in aerospace cryptographic systems software-oriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bits (SSPG-8) in one clock cycle, is proposed. The theoretical base of Self-Shrinking p-adic Generator is reca...
متن کاملPseudorandomness for Permutation Branching Programs Without the Group Theory
The typical way we derandomize a randomized computation is to replace the truly random bits used by the computation with suitable pseudorandom bits. We require that using pseudorandom, rather than truly random, bits does not change the output of the computation with probability more than ε; we call this parameter the error. The algorithm that produces the pseudorandom bits is called a pseudoran...
متن کاملLecture 17: Pseudorandom Generators Based on Scribe Notes
As we have seen, one way to resolve this question in the positive is to use the following two-step process: First show that the number of random bits for any BPP algorithm can be reduced from nc to O(log n), and then eliminate the randomness entirely by enumeration. Thus, we would like to have a function G : {0, 1}O(log n) → {0, 1}nc that stretches a seed of O(log n) truly random bits into nc b...
متن کاملEmploying online quantum random number generators for generating truly random quantum states in Mathematica
We present a new version of TRQS package for Mathematica computing system. The package allows harnessing quantum random number generators (QRNG) for investigating the statistical properties of quantum states. It implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015